#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e2;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n,k;cin>>n>>k;
      for(LL i=1;i<=n;i++) {
         cin>>a[i];
      }
      LL last=n;
      while(k){
         bool flag=1;
         LL fi=0;
         for(LL i=1;i<=n;i++){
             if(a[i]){
                fi=i;break;
             }
         }
         if(fi==0) flag=0;
         if(flag==0) break;
         a[fi]--;a[n]++;k--;
      }
      for(LL i=1;i<=n;i++){
          cout<<a[i]<<" ";
      }cout<<"\n";
   }
   return 0;
}
